Expert CF: Solving Data Matrix Sparsity and Computation Complexity Problems

Expert Mining for Solving Social Harmony Problems

Social harmony problems are being existed in social system, which is an open giant complex system. For solving such kind of problems the Metasynthesis system approach proposed by Qian XS et al will be applied. In this approach the data, information, knowledge, model, experience and wisdom should be integrated and synthesized. Data mining, text mining and web mining are good techniques for using...

Sparsity and Computation

Monday, 10.10-11.00 How can we obtain tractability? Erich Novak University of Jena We study numerical problems, like integration and approximation, defined for classes Fd of functions of d variables, say f : [0, 1] d → R for f ∈ Fd. The problem is polynomially tractable if the computing time is bounded by Cdqε−p for all d ∈ N, where ε > 0 is the error bound. We start with an example that shows ...

Solving Complexity and Ambiguity Problems within QualitativeSimulationbyDaniel

chattering region and successor states 4) (a) chatter{box algorithm ° . . . . . ↑ . . . . . ↑ . . . . . ↑ . . . . . ° INF A-1 0 T0 T1 T2 amount (B) ° . . . . . ↑ . . . . . ↑ . . . . . ↑ . . . . . ° INF A-2 0 T0 T1 T2 amount (C) ↑ . . . . . ↑↓ . . . . . ↓ . . . . . ↓ . . . . . ° INF 0 MINF T0 T1 T2 d amount (B) ° . . . . . ↑ . . . . . ° . . . . . ↓ . . . . . ° INF N-1 0 MINF T0 T1 T2 d amount (C...

Solving Knapsack Problems with Evolutionary Computation

Solving graph problems with dynamic computation structures

We introduce dynamic computation structures (DCS), a compilation technique to produce dynamic code for reconngurable computing. DCS specializes directed graph instances into user-level hardware for reconngurable architectures. Several problems such as shortest path and transitive closure exhibit the general properties of closed semirings, an algebraic structure for solving directed paths. Motiv...